38A - Army - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:

n = int(input())
d = list(input().split())
d = [int(i) for i in d]
a,b = input().split()
a = int(a)
b = int(b)
ans = 0
for i in range(a-1,b-1):
    ans += d[i]

print(ans)

C++ Code:

#include<bits/stdc++.h>
#define makeitfastread()      (ios_base:: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL));
#define modulo 10e9+7
#define nl '\n'
#define cy cout<<"YES"<<nl
#define cn cout<<"NO"<<nl

typedef long long int ll;
using namespace std;

int main()
{
    makeitfastread();
    ll test=1;
    cin>> test;
    ll arr[test+1];
    for(ll tt=1; tt<test; tt++)
    {
        cin>>arr[tt];
    }
    ll a,b,sum=0;
    cin>>a>>b;
    for(ll i=a;i<b;i++)
    {
        sum+=arr[i];
    }
    cout<<sum<<nl;

}


Comments

Submit
0 Comments
More Questions

1225A - Forgetting Things
1717A - Madoka and Strange Thoughts
1717B - Madoka and Underground Competitions
61B - Hard Work
959B - Mahmoud and Ehab and the message
802G - Fake News (easy)
1717C - Madoka and Formal Statement
420A - Start Up
1031A - Golden Plate
1559C - Mocha and Hiking
427B - Prison Transfer
330A - Cakeminator
426A - Sereja and Mugs
363A - Soroban
1585C - Minimize Distance
1506E - Restoring the Permutation
1539A - Contest Start
363D - Renting Bikes
1198D - Rectangle Painting 1
1023B - Pair of Toys
1725A - Accumulation of Dominoes
1675E - Replace With the Previous Minimize
839A - Arya and Bran
16B - Burglar and Matches
1625B - Elementary Particles
1725G - Garage
1725B - Basketball Together
735A - Ostap and Grasshopper
1183B - Equalize Prices
1481A - Space Navigation